Minimum Error Probability Cooperative Relay Design
نویسندگان
چکیده
منابع مشابه
Adaptive Linear Filtering Design with Minimum Symbol Error Probability Criterion
Adaptive digital filtering has traditionally been developed based on the minimum mean square error (MMSE) criterion and has found ever-increasing applications in communications. This paper presents an alternative adaptive filtering design based on the minimum symbol error rate (MSER) criterion for communication applications. It is shown that the MSER filtering is smarter, as it exploits the non...
متن کاملBit Error Probability Analysis of Cooperative Relay Selection OFDM Systems Based on SNR Estimation
Cooperative networking plays an important role in wireless adhoc and sensor networks, in which the information from the source to the destination is relayed by intermediate nodes. In this paper, we propose OFDM-based all subcarrier and per subcarrier basis relay selection schemes. The relay selection is based on average signal to noise ratio (SNR) estimation. Data aided (DA) preamble based MMSE...
متن کاملTransmission Systems Exact symbol error probability of cooperative systems with partial relay selection
In this paper, we derive the exact symbol error probability (SEP) of cooperative systems using amplify and forward (AF) relaying and partial relay selectionwhen the different links are independent and non-identically distributed. In conventional relay selection, the selected relay offers the best instantaneous signal to noise ratio (SNR) of the relaying link (source-relay-destination). However,...
متن کاملThe Minimum Error Minimax Probability Machine
We construct a distribution-free Bayes optimal classifier called the Minimum Error Minimax Probability Machine (MEMPM) in a worst-case setting, i.e., under all possible choices of class-conditional densities with a given mean and covariance matrix. By assuming no specific distributions for the data, our model is thus distinguished from traditional Bayes optimal approaches, where an assumption o...
متن کاملError Probability Bounds for M-ary Relay Trees
We study the detection error probabilities associated with an M -ary relay tree, where the leaves of the tree correspond to identical and independent sensors. Only these leaves are sensors. The root of the tree represents a fusion center that makes the overall detection decision. Each of the other nodes in the tree is a relay node that combines M summarized messages from its immediate child nod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2007
ISSN: 1053-587X
DOI: 10.1109/tsp.2006.885778